Isoperimetric Numbers of Cayley Graphs Arising from Generalized Dihedral Groups
نویسندگان
چکیده
Let n, x be positive integers satisfying 1 < x < n. Let Hn,x be a group admitting a presentation of the form 〈a, b | a = b = (ba) = 1〉. When x = 2 the group Hn,x is the familiar dihedral group, D2n. Groups of the form Hn,x will be referred to as generalized dihedral groups. It is possible to associate a cubic Cayley graph to each such group, and we consider the problem of finding the isoperimetric number, i(G), of these graphs. In section two we prove some propositions about isoperimetric numbers of regular graphs. In section three the special cases when x = 2, 3 are analyzed. The former case is solved completely. An upper bound, based on an analysis of the cycle structure of the graph, is given in the latter case. Generalizations of these results are provided in section four. The indices of these graphs are calculated in section five, and a lower bound on i(G) is obtained as a result. We conclude with several conjectures suggested by the results from earlier sections.
منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملHamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملEigenvalues of Transmission Graph Laplacians
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a “transmission” system. A transmission system is a mathematical representation of a means of transmitting (multi-parameter) data along directed edges from vertex to vertex. The associated transmission graph Laplacian is shown to have many of the former properties of the classica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002